An Elementary Approach to Some Analytic Asymptotics
نویسنده
چکیده
Fredman and Knuth have treated certain recurrences, such as M(O) 1 and M(n + 1) min (aM(k) + 3M(nk)) O 1, by means of auxiliary recurrences such as J" 0 if 0 _< x < 1, h(x) l+h(x/cz)+h(x//) ifl_<x< The asymptotic behavior of h(x) as x oo with a and 3 fixed depends on whether log a/logf is rational or irrational. The solution of Fredman and Knuth used analytic methods in both cases, and used in particular the Wiener-Ikehara Tauberian theorem in the irrational case. The author shows that a more explicit solution to these recurrences can be obtained by entirely elementary methods, based on a geometric interpretation of h(x) as a sum of binomial coefficients over a triangular subregion of Pascal’s triangle. Apart from Stirling’s formula, in the irrational case only the KroneckerWeyl theorem (which can itself be proved by elementary methods) is needed, to the effect that if t9 is irrational, the fractional parts of the sequence 9, 2, 3t9,..., are uniformly distributed in the unit interval. Key words, asymptotic analysis, recurrence relation AMS subject classification. 26A12
منابع مشابه
Geometric Decay in a QBD Process with Countable Background States with Applications to a Join-the-Shortest-Queue Model
A geometric tail decay of the stationary distribution has been recently studied for the GI/G/1 type Markov chain with both countable level and background states. This method is essentially the matrix analytic approach, and simplicity is an obvious advantage of this method. However, so far it can be only applied to the α-positive case (or the jittered case as referred to in the literature). In t...
متن کاملDiagonal asymptotics for symmetric rational functions via ACSV
We consider asymptotics of power series coefficients of rational functions of the form 1/Q where Q is a symmetric multilinear polynomial. We review a number of such cases from the literature, chiefly concerned either with positivity of coefficients or diagonal asymptotics. We then analyze coefficient asymptotics using ACSV (Analytic Combinatorics in Several Variables) methods. While ACSV someti...
متن کاملEntropy Computations via Analytic Depoissonization
Wojciech Szpankowskit Department of Computer Science Purdue University W. Lafayette, IN 47907 UB.A. [email protected] We investigate the basic question of information theory, namely, evaluation of Shannon entropy, and a more general Renyi entropy, for some discrete distributions (e.g., binomial, negative binomial, etc.). We aim at establishing analytic methods (Le., those in which complex analy...
متن کاملSome Notes on Standard Borel and Related Spaces
These notes give an elementary approach to parts of the theory of standard Borel and analytic spaces.
متن کاملAsymptotics of Coefficients of Multivariate Generating Functions: Improvements for Multiple Points
Let F (x) = ∑ ν∈Nd Fνx ν be a multivariate power series with complex coefficients that converges in a neighborhood of the origin. Assume F = G/H for some functions G and H holomorphic in a neighborhood of the origin. For example, F could be a rational combinatorial generating function. We derive asymptotics for the ray coefficients Fnα as n → ∞ for α in a permissible subset of d-tuples of posit...
متن کامل